A non-geodesic analogue of Reshetnyak’s majorization theorem

نویسندگان

چکیده

Abstract For any real number ? \kappa and integer n ? 4 n\ge 4 , the Cycl ( ) {{\rm{Cycl}}}_{n}\left(\kappa ) condition introduced by Gromov ( CAT(?)-spaces: construction concentration Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 280 (2001), (Geom. i Topol. 7), 100–140, 299–300) is a necessary for metric space to admit an isometric embedding into mathvariant="normal">CAT {\rm{CAT}}\left(\kappa space. geodesic spaces, satisfying {{\rm{Cycl}}}_{4}\left(\kappa equivalent being . In this article, we prove analogue of Reshetnyak’s majorization theorem (possibly non-geodesic) spaces that satisfy condition. It follows from our result general implies conditions all integers 5 5

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Majorization theorem for convexifiable functions

In this paper we extend the majorization theorem from convex to covexifiable functions, in particular to smooth functions with Lipschitz derivative, twice continuously differentiable functions and analytic functions. AMS subject classifications: 26B25, 52A40, 26D15

متن کامل

A Fractional Analogue of Brooks' Theorem

Let ∆(G) be the maximum degree of a graph G. Brooks’ theorem states that the only connected graphs with chromatic number χ(G) = ∆(G) + 1 are complete graphs and odd cycles. We prove a fractional analogue of Brooks’ theorem in this paper. Namely, we classify all connected graphs G such that the fractional chromatic number χf (G) is at least ∆(G). These graphs are complete graphs, odd cycles, C 2...

متن کامل

A Bipartite Analogue of Dilworth's Theorem

Let m(n) be the maximum integer such that every partially ordered set P with n elements contains two disjoint subsets A and B, each with cardinality m(n), such that either every element of A is greater than every element of B or every element of A is incomparable with every element of B. We prove that m(n) = Θ( n logn). Moreover, for fixed ǫ ∈ (0, 1) and n sufficiently large, we construct a par...

متن کامل

A Complex Analogue of Toda’s Theorem

Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting is considered to be a seminal result in computat...

متن کامل

A complex analogue of Toda's Theorem

Toda [19] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result which illustrates the power of counting is considered to be a seminal result in computati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Analysis and Geometry in Metric Spaces

سال: 2023

ISSN: ['2299-3274']

DOI: https://doi.org/10.1515/agms-2022-0151